Properties of Entire Functions Over Polynomial Rings via Gröbner Bases
نویسندگان
چکیده
منابع مشابه
Reduced Gröbner Bases in Polynomial Rings over a Polynomial Ring
We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we propose a new notion of reduced Gröbner bases in polynomial rings over a polynomial r...
متن کاملOn Gröbner bases and Krull dimension of residue class rings of polynomial rings over integral domains
Given an ideal a in A[x1, . . . , xn] where A is a Noetherian integral domain, we propose an approach to compute the Krull dimension of A[x1, . . . , xn]/a, when the residue class ring is a free A-module. When A is a field, the Krull dimension of A[x1, . . . , xn]/a has several equivalent algorithmic definitions by which it can be computed. But this is not true in the case of arbitrary Noetheri...
متن کاملOn Signature-Based Gröbner Bases Over Euclidean Rings
In this paper we present first steps in using signature-based Gröbner basis algorithms like Faugère’s F5 or GVW for computation over Euclidean rings. We present problems appearing when having to deal with coefficients and zero divisors and give practical solution techniques. A hybrid algorithm is presented trying to combine the advantages of signature-based and non-signature-based Gröbner basis...
متن کاملPolynomial GCD and Factorization via Approximate Gröbner Bases
We discuss computation of approximate Gröbner bases at high but finite precision. We show how this can be used to deduce exact results for various applications. Examples include implicitizing surfaces, finding multivariate polynomial greatest common divisors and factorizations over the rational and complex number fields. This is an extended version of a paper for SYNASC 2010: Proceedings of the...
متن کاملGröbner bases for polynomial systems with parameters
Gröbner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Gröbner basis in dependence of the values of the parameters. In this article, we present the algorithm GröbnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2003
ISSN: 0938-1279
DOI: 10.1007/s00200-003-0123-7